Routing Reliability Guaranteed Connections in WDM Mesh Networks

Reliability has been widely recognized as an important issue in wavelength-division multiplexing (WDM) networks. In order to accommodate a connection request, an active path (AP) has to be computed for the connection request. In case of a single AP cannot meet the reliability requirement, certain backup resources have to be allocated to the connection request such that the required reliability can be met. Traditionally, a single backup segment is computed to protect a part of the AP. This approach, however, fails to accommodate a connection request in some cases, even if there are sufficient resources to accommodate the connection request. In this paper, we propose a novel algorithm, called auxiliary-graphbased heuristic (AUGHT) to efficiently overcome this deficiency. Extensive simulations conducted on two typical mesh networks demonstrate the good performance of the AGUHT algorithm. Index words: wavelength-division multiplexing (WDM), survivability, reliability, mesh networks.